Observability of Lattice Graphs
نویسندگان
چکیده
منابع مشابه
Observability and reachability of simple grid and torus graphs ?
In this paper we investigate the observability and reachability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a grid or a torus. More in detail, under suitable conditions on the eigenvalue multiplicity, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all a...
متن کاملPLANAR LATTICE GRAPHS WITH.dvi
Introduction. The property of the Petersen graph of being hypohamiltonian is notorious, and known for a long time. The existence of hypotraceable graphs, on the contrary, was discovered much later. Before that, in 1966, Gallai [1] had asked the easier question whether (connected) graphs do exist such that each vertex is missed by some longest path. Such graphs have been discovered by Walther in...
متن کاملThe Lattice of Threshold Graphs
Due in part to their many interesting properties, a family of graphs has been studied under a variety of names, by various authors, since the late 1970’s. Only recently has it become apparent that the many different looking definitions for these threshold graphs are all equivalent. While the pedigree of strict partitions of positive integers is much older, their evolution into the lattice of sh...
متن کاملLattice bandwidth of random graphs
McDiarmid, C. and Z. Miller, Lattice bandwidth of random graphs, Discrete Applied Mathematics 30 (1991) 221-227. The bandwidth of a random graph has been well studied. A natural generalization of bandwidth involves replacing the path as host graph by a multi-dimensional lattice. In this paper we investigate the corresponding behavior for random graphs.
متن کاملLayout Problems on Lattice Graphs
This work deals with bounds on the cost of layout problems for lattice graphs and random lattice graphs. Our main result in this paper is a convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process. This result can be viewed as an analogue ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0049-z